Feasible graphs with standard universe
نویسندگان
چکیده
منابع مشابه
Brane Universe and Standard Cosmology
Brane cosmology takes the unconventional form H ∼ √ρ. To recover the standard cosmology, we have to assume that the matter density is much less than the brane tension. We show that the assumption can be justified even near the end of inflation if we fine-tune the coupling constant of the inflaton potential. As a consequence, the standard cosmology is recovered after inflation. PACS: 98.80-k; 04...
متن کاملTraining Feedforward Neural Networks with Standard Logistic Activations is Feasible
Training feedforward neural networks with standard logistic activations is considered difficult because of the intrinsic properties of these sigmoidal functions. This work aims at showing that these networks can be trained to achieve generalization performance comparable to those based on hyperbolic tangent activations. The solution consists on applying a set of conditions in parameter initiali...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملStandard Graphs in Lens Spaces
We prove a conjecture of Menasco and Zhang that if a tangle is completely tubing compressible then it consists of at most two families of parallel strands. This is related to problems of graphs in 3-manifold. The above conjecture follows from a theorem which says that a 1-vertex graph in M is standard in certain sense if and only if the exteriors of all its nontrivial subgraphs are handlebodies.
متن کاملInverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1998
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(97)00064-x